Vertex-deleted subgraphs and regular factors from regular graph
نویسندگان
چکیده
منابع مشابه
Remarks on regular factors in vertex-deleted subgraphs of regular graphs
Let G be a 2r-regular, 2r-edge-connected graph of odd order and let m be an integer such that 1 ~ m ~ r 1. For any vertex u of G, the graph G {u} has an m-factor which contains none of r m given edges. All graphs considered are finite. We shall allow graphs to contain multiple edges and we refer the reader to [2] for graph theoretic terms not defined in this paper. Let G be a graph. We denote b...
متن کاملSubgraphs Graph in a Distance-regular Graph
Let Γ denote a D-bounded distance-regular graph, where D ≥ 3 is the diameter of Γ. For 0 ≤ s ≤ D − 3 and a weak-geodetically closed subgraph ∆ of Γ with diameter s, define a graph G(∆) whose vertex set is the collection of all weak-geodetically closed subgraphs of diameter s+2 containing ∆, and vertex Ω is adjacent to vertex Ω′ in G if and only if Ω∩Ω′ as a subgraph of Γ has diameter s+1. We sh...
متن کاملVertex-deleted and Edge-deleted Subgraphs
The foremost problem in this area of graph theory is the Reconstruction Conjecture which states that a graph is reconstructible from its collection of vertex-deleted subgraphs. In spite of several attempts to prove the conjecture only very partial results have been obtained. Several of these results do however bring to light interesting structural relationships between a graph and its subgraphs...
متن کاملRegular induced subgraphs of a random Graph
An old problem of Erdős, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem, we consider the order of such a subgraph in a typical graph on n vertices, i.e., in a binomial random graph G(n, 1/2). We prove that with high probability a largest induced regular subgraph of G(n, 1/2) has about n ver...
متن کاملThree-regular Subgraphs of Four-regular Graphs'
The Berge–Sauer conjecture (see [2, 3]) says that any simple (no multiple edges and loops) 4-regular graph contains a 3-regular subgraph. This conjecture was proved in [4, 6]. In [1, 2] the Chevalley–Warning theorem was used to extend this result to graphs with multiple edges, which are 4-regular plus an edge. Our main result, Theorem 2.2, presents the sufficient condition for a 4-regular graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2011
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.04.035